Belt Distance Between Facets of Space-Filling Zonotopes
نویسنده
چکیده
To every d-dimensional polytope P with centrally symmetric facets one can assign a “subway map” such that every line of this “subway” contains exactly the facets parallel to one of the ridges of P . The belt diameter of P is the maximum number of subway lines one needs to use to get from one facet to another. We prove that the belt diameter of a d-dimensional space-filling zonotope does not exceed log2(4/5)d . DOI: 10.1134/S0001434612090064
منابع مشابه
A Note on Space Tiling Zonotopes
In 1908 Voronoi conjectured that every convex polytope which tiles space face-to-face by translations is affinely equivalent to the Dirichlet-Voronoi polytope of some lattice. In 1999 Erdahl proved this conjecture for the special case of zonotopes. A zonotope is a projection of a regular cube under some affine transformation. In 1975 McMullen showed several equivalent conditions for a zonotope ...
متن کاملThe weighted-volume derivative of a space-filling diagram.
Computing the volume occupied by individual atoms in macromolecular structures has been the subject of research for several decades. This interest has grown in the recent years, because weighted volumes are widely used in implicit solvent models. Applications of the latter in molecular mechanics simulations require that the derivatives of these weighted volumes be known. In this article, we giv...
متن کاملTwo- and Three-dimensional Tilings Based on a Model of the Six-dimensional Cube
A central-symmetric three-dimensional model of the sixdimensional cube can give us the idea of filling the space with mosaics of zonotopes. This model yields also plane tilings by its intersections. Using the parts of the model the mosaic and the tiling can further be dissected by projections, associations and Boolean operations. Further constructions are also indicated in the paper.
متن کاملOn the Approximation of Centered Zonotopes in the Plane
The present work is devoted to computation with zonotopes in the plane. Using ideas from the theory of quasivector spaces we formulate an approximation problem for zonotopes and propose an algorithm for its solution.
متن کاملVerification of Uncertain Embedded Systems by Computing Reachable Sets Based on Zonotopes
Formal verification using reachability analysis has been shown to be useful for detecting design failures for controlled embedded systems, and thus to improve dependability. If the state space is hybrid, however, the growth of complexity with the dimension of the continuous dynamics limits the applicability significantly. This paper proposes an efficient approach to computing reachable sets for...
متن کامل